Visual Hierarchical Dimension Reduction
نویسنده
چکیده
Traditional visualization techniques for multidimensional data sets, such as parallel coordinates, star glyphs, and scatterplot matrices, do not scale well to high dimensional data sets. A common approach to solve this problem is dimensionality reduction. Existing dimensionality reduction techniques, such as Principal Component Analysis, Multidimensional Scaling, and Self Organizing Maps, have serious drawbacks in that the generated low dimensional subspace has no intuitive meaning to users. In addition, little user interaction is allowed in those highly automatic processes. In this thesis, we propose a new methodology to dimensionality reduction that combines automation and user interaction for the generation of meaningful subspaces, called the visual hierarchical dimension reduction (VHDR) framework. Firstly, VHDR groups all dimensions of a data set into a dimension hierarchy. This hierarchy is then visualized using a radial space-filling hierarchy visualization tool called Sunburst. Thus users are allowed to interactively explore and modify the dimension hierarchy, and select clusters at different levels of detail for the data display. VHDR then assigns a representative dimension to each dimension cluster selected by the users. Finally, VHDR maps the high-dimensional data set into the subspace composed of these representative dimensions and displays the projected subspace. To accomplish the latter, we have designed several extensions to existing popular multidimensional display techniques, such as parallel coordinates, star glyphs, and scatterplot matrices. These displays have been enhanced to express semantics of the selected subspace, such as the context of the dimensions and dissimilarity among the individual dimensions in a cluster. We have implemented all these features and incorporated them into the XmdvTool software package, which will be released as XmdvTool Version 6.0. Lastly, we developed two case studies to show how we apply VHDR to visualize and interactively explore a high dimensional data set.
منابع مشابه
Visual Hierarchical Dimension Reduction for Exploration of High Dimensional Datasets
Traditional visualization techniques for multidimensional data sets, such as parallel coordinates, glyphs, and scatterplot matrices, do not scale well to high numbers of dimension. A common approach to solving this problem is dimensionality reduction. Existing dimensionality reduction techniques usually generate lower dimensional spaces that have little intuitive meaning to users and allow litt...
متن کاملReliability of dimension reduction visualizations of hierarchical structures
Dimension reduction can produce visualizations of hierarchical structures, like those produced by cluster analysis. So far, reliability of such visualizations has only been assessed with rudimentary means. Here, a method for assessing reliability of such visualizations is developed. It measures how accurately the location of a data point in high-dimensional hierarchy tree can be inferred from a...
متن کاملUsing Graphs for Fast Error Term Approximation of Time-varying Datasets
Session 1: Time-Varying, High Dimensional and Spatial Visualization Chair (Bill Ribarsky) 11h00-11h30 Using Graphs for Fast Error Term Approximation of Time-varying Datasets Christof Nuber, Eric C. LaMar, Valerio Pascucci, Bernd Hamann, Kenneth I. Joy 11h30-12h00 Visual Hierarchical Dimension Reduction for Exploration of High Dimensional Datasets Jing Yang, Matthew O. Ward, Elke A. Rundensteine...
متن کاملLearning Hierarchical Sparse Representations using Iterative Dictionary Learning and Dimension Reduction
This paper introduces an elemental building block which combines Dictionary Learning and Dimension Reduction (DRDL). We show how this foundational element can be used to iteratively construct a Hierarchical Sparse Representation (HSR) of a sensory stream. We compare our approach to existing models showing the generality of our simple prescription. We then perform preliminary experiments using t...
متن کاملJoint Hierarchical Domain Adaptation and Feature Learning
Complex visual data contain discriminative structures that are difficult to be fully captured by any single feature descriptor. While recent work in domain adaptation focuses on adapting a single hand-crafted feature, it is important to perform adaptation on a hierarchy of features to exploit the richness of visual data. We propose a novel framework for domain adaptation using a sparse and hier...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001